#include"sort.h"

int main(void)
{
	/*int arr[] = { 0,3,6,2,6,1,5,3,7,2,8,3,6,3,1,5,8,3};
	int n = sizeof(arr) / sizeof(arr[0]);

	InsertSort(arr, n);
	PrintArray(arr, n);*/

	/*int arr1[] = { 1,3,5,7,9,2,4,6,8,0 };
	int n1 = sizeof(arr1) / sizeof(arr1[0]);
	ShellSort(arr1, n1);
	PrintArray(arr1, n1);*/

	/*int arr2[] = { 1,2,2,3,4,4,3,3,1,1,6,6,3,3 };
	int n2 = sizeof(arr2) / sizeof(arr2[0]);
	SelectSort(arr2, n2);
	PrintArray(arr2, n2);*/

	//int arr3[] = {6,1,2,7,9,3,4,5,10,8};
	//int n3 = sizeof(arr3) / sizeof(arr3[0]);
	//QuickSort(arr3, 0,n3-1);
	//PrintArray(arr3, n3);
	 
	//int arr3[] = {6,1,2,7,9,3,4,5,10,8};
	//int n3 = sizeof(arr3) / sizeof(arr3[0]);
	//QuickSortNonr(arr3, 0,n3-1);
	//PrintArray(arr3, n3);

	int arr3[] = {6,1,2,7,9,3,4,5,10,8};
	int n3 = sizeof(arr3) / sizeof(arr3[0]);
	MergeSort(arr3,n3);
	PrintArray(arr3, n3);
	

	//TestOP();
	return 0;
}
